Computing with default logic
نویسندگان
چکیده
منابع مشابه
Computing Default Logic Extensions: An Implementation
Default logic [3] is a useful formalism for reasoning with incomplete information, its intuitive characteristics making it particularly suited for applications. Exten is a system currently capable of computing firstorder Reiter, Justified and Constrained default extensions. It is part of a project to create a full default logic workbench, with future work involving query evaluation, further sup...
متن کاملA Default Logic Patch for Default Logic
This paper is about the fusion of multiple information sources represented using default logic. More precisely, the focus is on solving the problem that occurs when the standard-logic knowledge parts of the sources are contradictory, as default theories trivialize in this case. To overcome this problem, it is shown that replacing each formula belonging to Minimally Unsatisfiable Subformulas by ...
متن کاملExpressing Default Logic Variants in Default Logic
Reiter’s default logic is one of the best known and most studied of the approaches to nonmonotonic reasoning. Several variants of default logic have subsequently been proposed to give systems with properties differing from the original. In this paper, we examine the relationship between default logic and its major variants. We accomplish this by translating a default theory under a variant inte...
متن کاملA System for Computing Constrained Default Logic Extensions
The aim of this paper is to describe the algorithmic foundations of the part of the program Exten responsible for the computation of extensions in Constrained Default Logic. Exten is a system that computes extensions for various default logics. The eeciency of the system is increased by pruning techniques for the search tree. We motivate and present these techniques, and demonstrate that they c...
متن کاملPrioritised Default Logic as Argumentation with Partial Order Default Priorities
We express Brewka’s prioritised default logic (PDL) as argumentation using ASPIC. By representing PDL as argumentation and designing an argument preference relation that takes the argument structure into account, we prove that the conclusions of the justified arguments correspond to the PDL extensions. We will first assume that the default priority is total, and then generalise to the case wher...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1999
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(99)00053-3